Implicitly Intersecting Weighted Automata using Dual Decomposition
نویسندگان
چکیده
We propose an algorithm to find the best path through an intersection of arbitrarily many weighted automata, without actually performing the intersection. The algorithm is based on dual decomposition: the automata attempt to agree on a string by communicating about features of the string. We demonstrate the algorithm on the Steiner consensus string problem, both on synthetic data and on consensus decoding for speech recognition. This involves implicitly intersecting up to 100 automata.
منابع مشابه
Intersecting Hierarchical and Phrase-Based Models of Translation: Formal Aspects and Algorithms
We address the problem of constructing hybrid translation systems by intersecting a Hiero-style hierarchical system with a phrase-based system and present formal techniques for doing so. We model the phrase-based component by introducing a variant of weighted finite-state automata, called σ-automata, provide a self-contained description of a general algorithm for intersecting weighted synchrono...
متن کاملLow-Rank Approximation of Weighted Tree Automata
We describe a technique to minimize weighted tree automata (WTA), a powerful formalism that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposition of the underlying Hankel matrix defined by the WTA. Our main theoretical result is an efficient algorithm for computing the SVD of an infinite Hankel matrix implicitly repre...
متن کاملWeighted Tree Automata Approximation by Singular Value Truncation
We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposition of the underlying Hankel matrix defined by the WTA. Our main theoretical result is an efficient algorithm for computing the SVD of an infinite Hankel matrix implicitly repr...
متن کاملThe Weighted Volume Derivative of a Space Filling Diagram
Figure 1: Computing geometric properties of a molecule. As common in biology, atoms are treated as intersecting balls, whose union forms the space-filling diagram. Richards and others proposed to study this union using the Voronoi diagram (or more exactly the power diagram since the balls have different radii). That diagram divides the space into convex cells, one per atom. In the two-dimension...
متن کاملSingular value automata and approximate minimization
The present paper uses spectral theory of linear operators to construct approximately minimal realizations of weighted languages. Our new contributions are: (i) a new algorithm for the SVD decomposition of infinite Hankel matrices based on their representation in terms of weighted automata, (ii) a new canonical form for weighted automata arising from the SVD of its corresponding Hankel matrix a...
متن کامل